An entanglement monotone derived from Grover's algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entanglement Witness Derived From NMR Superdense Coding

We show that it is possible to transfer two-bit information via encoding a single qubit in a conventional nuclear magnetic resonance (NMR) experiment with two very weakly polarized nuclear spins. Nevertheless, the experiment can not be regarded as a demonstration of superdense coding by means of NMR because it is based on the large number of molecules being involved in the ensemble state rather...

متن کامل

An Explicit Algorithm for Monotone Variational Inequalities

We introduce a fully explicit method for solving monotone variational inequalities in Hilbert spaces, where orthogonal projections onto C are replaced by projections onto suitable hyperplanes. We prove weak convergence of the whole generated sequence to a solution of the problem, under the only assumptions of continuity and monotonicity of the operator and existence of solutions.

متن کامل

An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems

This paper presents and analyzes a strongly convergent approximate proximal point algorithm for finding zeros of maximal monotone operators in Hilbert spaces. The proposed method combines the proximal subproblem with a more general correction step which takes advantage of more information on the existing iterations. As applications, convex programming problems and generalized variational inequa...

متن کامل

An Interior Point Algorithm for Monotone Affine Variational Inequalities

Given an n n matrix M, a vector q in IR n , and a polyhedral convex set X = fxjAx b; Bx = dg, where A is an m n matrix and B is an p n matrix, the aane variational inequality problem is to nd x 2 X such that (Mx + q) T (y ? x) 0 for all y 2 X. If M is positive semi-deenite, the aane variational inequality can be transformed to a generalized complementarity problem, which can be solved in polyno...

متن کامل

An Approximate Dynamic Programming Algorithm for Monotone Value Functions

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2002

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.65.062312